منابع مشابه
Consistent Detection of Global Predicates under a Weak Fault Assumption
We study the problem of detecting general global predicates in distributed systems where all application processes and at most t < m monitor processes may be subject to crash faults, where m is the total number of monitor processes in the system. We introduce two new observation modalities called negotiably and discernibly (which correspond to possibly and definitely in fault-free systems) and ...
متن کاملDetection of Global State Predicates
This paper examines algorithms for detecting when a property 4> holds during the execution of a distributed system. The properties we consider are expressed over the state of the system and are not assumed to have properties that facilitate detection, such as stability. Detection is done by a monitoring process within the system, which cannot perceive an execution of a distributed system as a t...
متن کاملConsistent Detection of Global Predicates in Asynchronous Distributed Systems with Crash Failures
A fundamental problem in testing and analysis of distributed systems is detecting whether the global state of a system satisses some predicate throughout a computation. There exist some well-developed methods for detecting predicates in fault-free systems (e.g., the predicate transformers possibly and deenitely of Cooper, Marzullo and Neiger), but for systems running in faulty environments ndin...
متن کاملOn Detection of Bounded Global Predicates
Distributed programs often follow some bounded global predicates, for example, the total number of certain tokens is always the same or bounded in a range. In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range. Recently, Chase and Garg proposed an efficient method to derive the mi...
متن کاملEfficient Detection of Restricted Classes of Global Predicates
We show that the problem of predicate detection in distributed systems is NP-complete. We introduce a class of predicates, linear predicates, such that for any linear predicate B there exists an efficient detection of the least cut satisfyingB. The dual of linearity is post-linearity. These properties generalize several known properties of distributed systems, such as the set of consistent cuts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1991
ISSN: 0362-1340,1558-1160
DOI: 10.1145/127695.122774